skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Creators/Authors contains: "Pelejo, Diane Christine"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; ; (, Discrete and Continuous Dynamical Systems - S)
    It is shown that for any positive integer \begin{document}$$ n \ge 3 $$\end{document}, there is a stable irreducible \begin{document}$$ n\times n $$\end{document} matrix \begin{document}$ A $$\end{document} with \begin{document}$$ 2n+1-\lfloor\frac{n}{3}\rfloor $$\end{document} nonzero entries exhibiting Turing instability. Moreover, when \begin{document}$$ n = 3 $$\end{document}, the result is best possible, i.e., every \begin{document}$$ 3\times 3 $$\end{document} stable matrix with five or fewer nonzero entries will not exhibit Turing instability. Furthermore, we determine all possible \begin{document}$$ 3\times 3 $$\end{document} irreducible sign pattern matrices with 6 nonzero entries which can be realized by a matrix \begin{document}$$ A $$\end{document}$ that exhibits Turing instability. 
    more » « less
    Full Text Available